منابع مشابه
Institute for Mathematical Physics Nonstandard Analysis in Point{set Topology Nonstandard Analysis in Point-set Topology
We present Nonstandard Analysis by three axioms: the Extension, Transfer and Saturation Principles in the framework of the superstructure of a given innnite set. We also present several applications of this axiomatic approach to point-set topology. Some of the topological topics such as the Hewitt realcompactiication and the nonstandard characterization of the sober spaces seem to be new in the...
متن کاملComputation of Force Closure Grasps from Finite Contact Point Set
A Robot, from its very name, literally means “forced labor”. To live up to this title, an ability to interact with milieu is crucial. A robot should be able to manipulate objects. With a hand capable of grasping, a robot is blessed with greater degree of influent. Complex manipulation and maneuver are possible with grasping. Moreover, grasping allows robot to use tools readily available for hum...
متن کاملAnalysis of a Supervised Set-Point Control Containing a Compact Continuum of Finite-Dimensional Linear Controllers
A simple analysis is given of the behavior of a set-point control system consisting of a poorly modelled process, an integrator and a multi-controller supervised by an estimator-based algorithm employing dwell-time switching. For a slowly switched multi-controller implementation of a compact continuum of finite-dimensional linear controllers, bounds are derived for the normed-value of the proce...
متن کاملSampling Point-Set Implicits
We present a novel approach for point-set implicit surface sampling that is able to rapidly distribute particles over the surface of 3D objects. Our methods benefit from the inner structure of a MPU implicit to obtain a near-optimal initial distribution, with higher densities in areas of higher complexity. The adequate number of particles to effectively sample the surface is determined almost a...
متن کاملUpward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of k-switch trees, that is a generalization of switch trees (according to this definition a switch t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1993
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1993.104544